Texture Minification using Quad-trees and Fipmaps
نویسندگان
چکیده
The paper extends the recently published methods for image reconstruction and texture minification using the generalized ripmap method, named fipmap, and quad-trees. Fipmap is based on the technique of partitioned iterated function systems, used in fractal image compression. The quad-tree texture reconstruction algorithm works well for many standard cases. The special cases can be solved using the fipmap minification. The approach was applied for textures from architectural image sequences and the results are very promising.
منابع مشابه
P´olya Urn Models and Connections to Random Trees: A Review
This paper reviews P´olya urn models and their connection to random trees. Basic results are presented, together with proofs that underly the historical evolution of the accompanying thought process. Extensions and generalizations are given according to chronology: • P´olya-Eggenberger’s urn • Bernard Friedman’s urn • Generalized P´olya urns • Extended urn schemes • Invertible urn schemes ...
متن کاملEntropy Quad-Trees for High Complexity Regions Detection
This paper introduces entropy quad-trees, which are structures derived from quad-trees by allowing nodes to split only when those correspond to sufficiently complex sub-domains of a data domain. Complexity is evaluated using an information-theoretic measure based on the analysis of the entropy associated to sets of objects designated by nodes. An alternative measure related to the concept of bo...
متن کاملCS 314: Magnification and Minification
Actually, there is first a small technical issue of mapping between texture coodinates, which might be defined on any arbitrary rectangle in 2D, and actual texel coordinates (e.g. numbers between 0 and 512 for a 512 × 512 texture image). This is handled as usual by a windowing transform, which can be conveniently represented with a transformation matrix: as mentioned last time, OpenGL even prov...
متن کاملJust-in-Time Texture Synthesis
Texture bombing is a texture synthesis approach that saves memory by stopping short of assembling the output texture from the arrangement of input texture patches; instead, the arrangement is used directly at run time to texture surfaces. However, several problems remain in need of better solutions. One problem is improving texture diversification. A second problem is that mipmapping cannot be ...
متن کاملSpeeding-up Image Encoding times in the SPIHT Algorithm
In this paper, a new approach (scheme) to the analysis of quad-trees in the discrete wavelet spectrum of a digital image is proposed. During the pre-scanning phase, the proposed scheme generates problem-oriented binary codes for the whole set of quad-tree roots (wavelet coefficients) and thereby accumulates information on the significance of respective descendants (wavelet coefficients comprisi...
متن کامل